GATE CSE 1999
Q11.
Which of the following disk scheduling strategies is likely to give the best throughput?Q12.
Two girls have picked 10 roses, 15 sunflowers and 15 daffodils. What is the number of ways they can divide the flowers among themselves?Q13.
The minimum number of record movements required to merge five files A (with 10 records), B (with 20 records), C (with 15 records), D (with 5 records) and E (with 25 records) is:Q16.
Consider the schema R=(S,T, U, V) and the dependencies S \rightarrow T, T \rightarrow U, U \rightarrow V and V \rightarrow S. Let R = (R1\text{ and } R2) be a decomposition such that R1 \cap R2 \neq \phi. The decomposition isQ17.
The Newton-Raphson method is to be used to find the root of the equation f(x)=0 where x_o is the initial approximation and f' is the derivative of f. The method convergesQ18.
Which of the following actions is/are typically not performed by the operating system when switching context from process A to process B?Q19.
Let L_1 be the set of all languages accepted by a PDA by final state and L_2 the set of all languages accepted by empty stack. Which of the following is true?Q20.
Consider the join of a relation R with a relation S. If R has m tuples and S has n tuples then the maximum and minimum sizes of the join respectively are